Fixed-point methods for computing the equilibrium composition of complex biochemical mixtures

Fixed-point methods for computing the equilibrium composition of complex biochemical mixtures.

The fixed-point algebraic method [Storer and Cornish-Bowden (1976) Biochem. J. 159, 1-5] for computing the concentrations at equilibrium of complex biochemical mixtures fails for many binding stoichiometries, especially those that include molecular self-association. A typical example is the monomer-dimer-tetramer equilibrium. This paper reports two main results. First, the above algorithm is an...

Iterative Methods for Equilibrium Problems, Variational Inequalities and Fixed Points

Monotone variational inequalities, generalized equilibrium problems and fixed point methods

In this paper, we study monotone variational inequalities and generalized equilibrium problems. Weak convergence theorems are established based on a fixed point method in the framework of Hilbert spaces.

Fixed-Point Algorithms for the Blind Separation of Arbitrary Complex-Valued Non-Gaussian Signal Mixtures

We derive new fixed-point algorithms for the blind separation of complex-valued mixtures of independent, noncircularly symmetric, and non-Gaussian source signals. Leveraging recently developed results on the separability of complex-valued signal mixtures, we systematically construct iterative procedures on a kurtosis-based contrast whose evolutionary characteristics are identical to those of th...

Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation

We consider the generalized Nash equilibrium problem (GNEP), where not only the players’ cost functions but also their strategy spaces depend on the rivals’ decision variables. Existence results for GNEPs are typically shown by using a fixed point argument for a certain set-valued function. Here we use a regularization of this set-valued function in order to obtain a single-valued function that...